Domination Reliability
نویسندگان
چکیده
In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph. We derive explicit and recursive formulæ for domination reliability and its associated domination reliability polynomial, deduce an analogue of Whitney’s broken circuit theorem, and prove that computing domination reliability is NP-hard.
منابع مشابه
On the characterization of the domination of a diameter-constrained network reliability model
Let G= (V ,E) be a digraph with a distinguished set of terminal vertices K ⊆ V and a vertex s ∈ K . We define the s,K-diameter of G as the maximum distance between s and any of the vertices of K. If the arcs fail randomly and independently with known probabilities (vertices are always operational), the diameter-constrained s,K-terminal reliability of G, Rs,K(G,D), is defined as the probability ...
متن کاملSigned Domination of Oriented Matroid Systems
The domination function has played an important part in reliability theory. While most of the work in this field has been restricted to various types of network system models, many of the results can be generalized to much wider families of systems associated with matroids. Previous papers have explored the relation between undirected network systems and matroids. In this paper the main focus i...
متن کاملA factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V specified. Edge failures are assumed to be statistically independent and to have known probabilities. The K-terminal reliability of G,, denoted R(G,), is the probability that all vertices in K are connected by working edges. Computing K-terminal reliability is an NP-hard problem not known to be in NP. ...
متن کاملOn Domination of a Vertex as Exponentially
The assessment of the stability and the vulnerability of complex networks is the important concept while studying of them. In the literature, a sort of measures have been given in order to assessment the stability of systems. And also, some graph-theoretic parameters have been formed to provide formulas which calculate the reliability of a network. In this paper, we study the vulnerability of s...
متن کاملUpper bounds for the bondage number of graphs on topological surfaces
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a graph having the domination number larger than that of G. In a sense, the bondage number b(G) measures integrity and reliability of the domination number γ(G) with respect to the edge removal, which corresponds, e.g., to link failures in communication networks. We show that, for a graph G having...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012